A Traceability Conjecture for Oriented Graphs
نویسندگان
چکیده
A (di)graph G of order n is k-traceable (for some k, 1 ≤ k ≤ n) if every induced sub(di)graph of G of order k is traceable. It follows from Dirac’s degree condition for hamiltonicity that for k ≥ 2 every k-traceable graph of order at least 2k − 1 is hamiltonian. The same is true for strong oriented graphs when k = 2, 3, 4, but not when k ≥ 5. However, we conjecture that for k ≥ 2 every k-traceable oriented graph of order at least 2k − 1 is traceable. The truth of this conjecture would imply the truth of an important special case of the Path Partition Conjecture for Oriented Graphs. In this paper we show the conjecture is true for k ≤ 5 and for certain classes of graphs. In addition we show that every strong k-traceable oriented graph of order at least 6k − 20 is traceable. We also characterize those graphs for which all walkable orientations are k-traceable.
منابع مشابه
Progress on the Traceability Conjecture for Oriented Graphs
Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did the teacher. Some books are fully read in a week and we need the obligation to support reading. What about now? Do you still love reading? Is reading only for you who have obligation? Absolutely not! We here offer you a new book enPDFd progress on the traceability con...
متن کاملA Linear Bound towards the Traceability Conjecture
A digraph is k-traceable if its order is at least k and each of its subdigraphs of order k is traceable. An oriented graph is a digraph without 2-cycles. The 2-traceable oriented graphs are exactly the nontrivial tournaments, so k-traceable oriented graphs may be regarded as generalized tournaments. It is well-known that all tournaments are traceable. We denote by t(k) the smallest integer bigg...
متن کاملComputational Results on the Traceability of Oriented Graphs of Small Order
A digraph D is traceable if it contains a path visiting every vertex, and hypotraceable if D is not traceable, but D − v is traceable for every vertex v ∈ V (D). Van Aardt, Frick, Katrenic̃ and Nielsen [Discrete Math. 11(2011), 1273-1280] showed that there exists a hypotraceable oriented graph of order n for every n > 8, except possibly for n = 9 or 11. These two outstanding existence questions ...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملAn Iterative Approach to the Traceability Conjecture for Oriented Graphs
A digraph is k-traceable if its order is at least k and each of its subdigraphs of order k is traceable. The Traceability Conjecture (TC) states that for k > 2 every k-traceable oriented graph of order at least 2k − 1 is traceable. It has been shown that for 2 6 k 6 6, every k-traceable oriented graph is traceable. We develop an iterative procedure to extend previous results regarding the TC. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008